منابع مشابه
Succinctness of Epistemic Languages
Proving that one language is more succinct than another becomes harder when the underlying semantics is stronger. We propose to use Formula-Size Games (as put forward by Adler and Immerman, 2003), games that are played on two sets of models, and that directly link the length of play with the size of the formula. Using FSGs, we prove three succinctness results for m-dimensional modal logic: (1) ...
متن کاملAnomalous Learning Helps Succinctness
It is shown that allowing a bounded number of anomalies (mistakes) in the final programs learned by an algorithmic procedure can considerably “succinctify” those final programs. Naturally, only those contexts are investigated in which the presence of anomalies is not actually required for successful inference (learning). The contexts considered are certain infinite subclasses of the class of ch...
متن کاملOn the Succinctness of Nondeterminism
Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the relative succinctness of the different classes of nondeterministic automata. For example, while the best translation from a nondeterministic Büchi automaton to a nondeterministic co-Büchi automaton is exponential, and involves...
متن کاملOn the (In)Succinctness of Muller Automata
There are several types of finite automata on infinite words, differing in their acceptance conditions. As each type has its own advantages, there is an extensive research on the size blowup involved in translating one automaton type to another. Of special interest is the Muller type, providing the most detailed acceptance condition. It turns out that there is inconsistency and incompleteness i...
متن کاملOn the Succinctness of RoCTL*
It can be desirable to specify policies that require a system to achieve some outcome even if a certain number of failures occur. The temporal logic of robustness RoCTL* extends CTL* with operators from Deontic logic, and a novel operator referred to as Robustly (French, MCabe-Dansted & Reynolds 2007). It is known that RoCTL* can be translated into CTL*, but that the translation must be have at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90007-5